Some graph parameters and extended Fibonacci cubes
نویسندگان
چکیده
The fundamental component of a distributed system is the interconnection network. The network topology is significant since the communication between processors is derived via message exchange in distributed systems. Graph can be used for modeling the interconnection network. In case, by using combinatorics and graph theory, the properties of a network can be recognized. There have been studies on various interconnection network topologies. The Extended Fibonacci Cubes are network topologies yielding useful properties for an interconnection network. In this paper, some of the vertex vulnerability parameters of the Extended Fibonacci Cubes are determined.
منابع مشابه
On Embeddings of Hamiltonian Paths and Cycles in Extended Fibonacci Cubes
The interconnection network is an essential component of a distributed system or of a supercomputer based on large-sale parallel processing. Because in distributed systems the communication between processors is based on message exchange, the network topology is of a great importance. The interconnection network can be seen as a graph and the properties of a network can be studied using combina...
متن کاملIndependent Resolving Number of Fibonacci Cubes and Extended Fibonacci Cubes
A subset S of vertices in a graph G is said to be an independent set of G if each edge in the graph has at most one endpoint in S and a set W ( V is said to be a resolving set of G, if the vertices in G have distinct representations with respect to W. A resolving set W is said to be an independent resolving set, or an ir-set, if it is both resolving and independent. The minimum cardinality of W...
متن کاملIndependent Resolving Number of Fibonacci Cubes and Extended Fibonacci Cubes
A subset S of vertices in a graph G is said to be an independent set of G if each edge in the graph has at most one endpoint in S and a set W ( V is said to be a resolving set of G, if the vertices in G have distinct representations with respect to W. A resolving set W is said to be an independent resolving set, or an ir-set, if it is both resolving and independent. The minimum cardinality of W...
متن کاملThe (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملIndependent Resolving Number of Fibonacci Cubes and Extended Fibonacci Cubes
A subset S of vertices in a graph G is said to be an independent set of G if each edge in the graph has at most one endpoint in S and a set W ( V is said to be a resolving set of G, if the vertices in G have distinct representations with respect to W. A resolving set W is said to be an independent resolving set, or an ir-set, if it is both resolving and independent. The minimum cardinality of W...
متن کامل